ASPECTS OF STRUCTURAL COMBINATORICS ( Graph Homomorphisms and Their Use )
نویسنده
چکیده
This paper is based on a course delivered by the author at NCTS, National Chiao Tung University, Taiwan in Febuary 1999. We survey results related to structural aspects of graph homomorphism. Our aim is to demonstrate that this forms today a compact collection of results and methods which perhaps deserve its name : structural combinatorics. Due to space limitations we concentrate on a sample of areas only: representation of algebraic structures by combinatorial ones (graphs), the poset of colour classes and corresponding algorithmic questions which lead to homomorphism dualities, blending algebraic and complexity approaches.
منابع مشابه
Statement of David Galvin , July 31 , 2012
The main thrust of my research is the use of techniques from information theory, probability and combinatorics to study structural, enumerative and algorithmic aspects of graph homomorphisms and related models, both in particular instances (independent sets and colorings, for example) and in general. Graph homomorphisms are important objects in graph theory, where they generalize a number of ce...
متن کاملHomomorphisms and Structural Properties of Relational Systems
Preface My interest in graph homomorphisms dates back to the Spring School of Combinatorics in . e School is traditionally organised by the Department of Applied Mathematics of the Charles University in a hilly part of the Czech Republic; in it was one of the few times when the Spring School was international not only in terms of its participants, but also in terms of its venue. Partic...
متن کاملGraph homomorphisms: structure and symmetry
This paper is the first part of an introduction to the subject of graph homomorphism in the mixed form of a course and a survey. We give the basic definitions, examples and uses of graph homomorphisms and mention some results that consider the structure and some parameters of the graphs involved. We discuss vertex transitive graphs and Cayley graphs and their rather fundamental role in some asp...
متن کاملUse of Structure Codes (Counts) for Computing Topological Indices of Carbon Nanotubes: Sadhana (Sd) Index of Phenylenes and its Hexagonal Squeezes
Structural codes vis-a-vis structural counts, like polynomials of a molecular graph, are important in computing graph-theoretical descriptors which are commonly known as topological indices. These indices are most important for characterizing carbon nanotubes (CNTs). In this paper we have computed Sadhana index (Sd) for phenylenes and their hexagonal squeezes using structural codes (counts). Sa...
متن کاملAsymptotic Structure of Graphs with the Minimum Number of Triangles
We consider the problem of minimizing the number of triangles in a graph of given order and size and describe the asymptotic structure of extremal graphs. This is achieved by characterizing the set of flag algebra homomorphisms that minimize the triangle density.
متن کامل